We propose a new speed and departure time optimization algorithm for thePollution-Routing Problem (PRP) which runs in quadratic time. This algorithm isembedded into an iterated local search-based metaheuristic to achieve acombined speed, scheduling and routing optimization. Extensive computationalexperiments are conducted on classic PRP benchmark instances. Allowing delayeddeparture times from the depot significantly increases the search space, andcontributes to reduce CO 2 emissions by 8.31% on the considered instances.
展开▼
